SMT vs Genetic Algorithms: Concrete Planning in PlanICS Framework
نویسندگان
چکیده
The paper deals with the concrete planning problem (CPP) – a stage of the Web Service Composition (WSC) in the PlanICS framework. A novel SMT-based approach to CPP is defined and its performance is compared to the standard Genetic Algorithm (GA) in the framework of the PlanICS system. The discussion of both the approaches is supported by extensive experimental results.
منابع مشابه
Combining Genetic Algorithm and SMT into Hybrid Approaches to Web Service Composition Problem
The paper deals with the concrete planning problem – a stage of the Web Service Composition in the PlanICS framework, which consists in choosing the best service offers in order to satisfy the user query and to maximize the quality function. We introduce a novel planning technique based on a combination of a Genetic Algorithm (GA) with a Satisfiability Modulo Theories (SMT) solver, which allows...
متن کاملHybrid Planning by Combining SMT and Simulated Annealing
We present a new approach to the concrete planning (CP) shown to be a NP-hard problem [7]. This is the third stage of Web service composition (WSC) in the PlanICS framework [1]. The first two phases, namely an abstract planning and offer collecting, basing on an ontology, a user query, and a service registry provide data necessary for CP. A new hybrid algorithm (HSA), which combines Simulated A...
متن کاملTripICS - a Web Service Composition System for Planning Trips and Travels (extended abstract)
Automatic composition of Web services is a very active area of research which has provided a lot of important results [10, 1, 15, 6] as well as many implemented approaches [11, 12, 2, 3, 13]. In this paper we present the system TripICS a real-life application of our Web service composition system PlanICS [8, 9, 13] to planning trips and travels around the world. While there are systems offering...
متن کاملSMT-based Abstract Temporal Planning
An abstract planning is the rst phase of the web service composition in the Planics framework. A user query speci es the initial and the expected state of a plan in request. The paper extends Planics with a module for temporal planning, by extending the user query with an LTL−X formula specifying temporal aspects of world transformations in a plan. Our solution comes together with an example, a...
متن کاملPlanICS 2.0 - A Tool for Composing Services
This poster reports on the current state of the Planics toolset, which aims at solving the Web service composition problem by dividing it into several stages. These include an abstract planning, an o↵er collecting, and a concrete planning.
متن کامل